Power-law Correlations of Connectivities in Biomolecular Networks

نویسندگان

  • Kazuhiro Takemoto
  • Chikoo Oosawa
چکیده

Complex networks which describe biological systems such as gene regulations and metabolisms indicate several striking statistical properties such as power-law degree distribution P (k)∼k−γ that is a scalefree property and high clustering coefficient, yielding nontrivial interpretations for topologies and signal transductions of the networks [1]. In this report, we forcus on degree correlation k̄nn(k) [3] denotes average degree (number of edges) of nearest neighbors of nodes with degree k to examine features of neighbor connectivities in the networks. We show that various biomolecular networks exhibit conserved correlations of connectivities; the correlations were initially found in the protein-protein interaction and the regulatory networks in yeast [2]. Furthermore, we propoase a growth network model which reproduces the correlations and provides insights into topologies of the biomolecular networks and several evolutionary mechanisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifying the connectivity of a network: the network correlation function method.

Networks are useful for describing systems of interacting objects, where the nodes represent the objects and the edges represent the interactions between them. The applications include chemical and metabolic systems, food webs as well as social networks. Lately, it was found that many of these networks display some common topological features, such as high clustering, small average path length ...

متن کامل

Mean - eld theory for scale - free random networks

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information is available display scale-free features. Here we study the scaling properties of the recently introduced scale-free model, that can account for the observed ...

متن کامل

Mean-field theory for scale-free random networks

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information is available display scale-free features. Here we study the scaling properties of the recently introduced scale-free model, that can account for the observed ...

متن کامل

Is it really a small world - network connectivity revisited

Submitted for the MAR10 Meeting of The American Physical Society Is it really a small world network connectivity revisited BARUCH BARZEL, OFER BIHAM, The Hebrew University — Networks are useful for describing systems of interacting objects, the applications include chemical and metabolic systems, food webs as well as social networks. Lately, it was found that many of these networks display some...

متن کامل

Breakdown of interdependent directed networks.

Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004